Modal Sequents and Definability

نویسنده

  • Bruce M. Kapron
چکیده

We examine a certain modal consequence relation, and define the notion of validity of a modal sequent on a frame. We demonstrate that it is possible to define classes of frames. not definable by modal formulas, by modal sequents. Through the use of modal algebras and general frames, we obtain a characterization of modal sequent-definable classes of frames which are also first-order definable, and a sufficient condition for a class of frames to be definable by modal sequents. ACKNOWLEDGEMENTS AND DEDICATION First of all, I would like to thank my supervisor. Dr. Steve Thomason, for his support and guidance throughout the writing of this thesis. I would also like to thank Dr. Ray Jennings and the Institute for Applied Logic for supplying computing and typesetting resources. Finally, I would like to acknowledge the support that I received from NSERC during part of my time at SFU. This thesis is dedicated to my father and to the memory of my mother.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof Theory for Indexed Nested Sequents

Fitting’s indexed nested sequents can be used to give deductive systems to modal logics which cannot be captured by pure nested sequents. In this paper we show how the standard cut-elimination procedure for nested sequents can be extended to indexed nested sequents, and we discuss how indexed nested sequents can be used for intuitionistic modal logics.

متن کامل

Nested Sequents

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested sequents stay inside the modal language and allow for proof systems which enjoy the subformula property in the literal sense. In the first part we study a system...

متن کامل

Decidability and Complexity of Definability within the Class of All Partitions

This paper is devoted to exploring modal definability of firstorder sentences and first-order definability of modal formulas. It investigates the decidability and the complexity of these problems within the class of all partitions.

متن کامل

Global Definability in Basic Modal Logic

We present results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability.

متن کامل

On Nested Sequents for Constructive Modal Logics

We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the standard modal logics K4, S4, and S5. We use for our presentation the formalism of nested sequents and give a syntactic proof of cut elimination.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 52  شماره 

صفحات  -

تاریخ انتشار 1987